Puiseux Series Polynomial Dynamics and Iteration of Complex Cubic Polynomials
نویسنده
چکیده
We study polynomials with coefficients in a field L as dynamical systems where L is any algebraically closed and complete ultrametric field with dense valuation group and characteristic zero residual field. We give a complete description of the dynamical and parameter space of cubic polynomials. In particular we characterize cubic polynomials with compact Julia sets. Also, we prove that any infraconnected connected component of a filled Julia set (of a cubic polynomial) is either a point or eventually periodic. A smallest field S with the above properties is, up to isomorphism, the completion of the field of formal Puiseux series with coefficients in an algebraic closure of Q. We show that some elements of S naturally correspond to the Fourier series of analytic almost periodic functions (in the sense of Bohr) which parametrize (near infinity) the quasiconformal classes of non-renormalizable complex cubic polynomials. Our techniques are based on the ideas introduced by Branner and Hubbard to study complex cubic polynomials.
منابع مشابه
Puiseux Series Solutions of Ordinary Polynomial Differential Equations : Complexity Study
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given in 1990 by Grigoriev for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for arbitrary differential polynomials. The alg...
متن کاملThe iteration of cubic polynomials Part I: The global topology of parameter space
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 CHAPTER I. Univalent functions in complex analytic dynamics . . . . . . 147 1. Attraction to infinity . . . . . . . . . . . . . . . . . . . . . . . 147 2. Parametrizing the space of polynomials . . . . . . . . . . . . . 150 3. Compactness of the connectedness locus . . . . . . . . . . . . 153 4. The mapping q~e is ...
متن کاملOn the complexity of solving ordinary differential equations in terms of Puiseux series
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for arbitrary differential polynomials. The algori...
متن کاملThe Combinatorial Rigidity Conjecture Is False for Cubic Polynomials
We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995. Introduction and result Let Pd = {z + ad−2z + · · · + a0} ↔ Cd−1 be the space of monic centered polynomials of degree d > 1. Our object is to show that there exists a cubic polynomial...
متن کاملA note on the computation of Puiseux series solutions of the Riccatti equation associated with a homogeneous linear ordinary differential equation
We present in this paper a detailed note on the computation of Puiseux series solutions of the Riccatti equation associated with a homogeneous linear ordinary differential equation. This paper is a continuation of [1] which was on the complexity of solving arbitrary ordinary polynomial differential equations in terms of Puiseux series. Introduction LetK = Q(T1, . . . , Tl)[η] be a finite extens...
متن کامل